EÆcient EM Learning with Tabulation for Parameterized Logic Programs Yoshitaka KAMEYA and Taisuke SATO Dept. of Computer Science, Graduate School of Information Science and Engineering, Tokyo Institute of Technology, Oo

Source URL: rjida.meijo-u.ac.jp

ROSAEC MEMO ROSAECSeptember 6, 2011 CPS Transformation of Lisp-Like Multi-Staged Languages

Source URL: ludovicpatey.com

• Software engineering
• Logic
• Declarative programming
• Models of computation
• Computability theory
• Lambda calculus
• Theoretical computer science
• Continuation-passing style
• Free variables and bound variables
• Substitution

Reprinted from the 15th International Symposium on Principles and Practice of Declarative Programming (PPDPEngineering Definitional Interpreters Jan Midtgaard Norman Ramsey

Source URL: www.cs.tufts.edu

• Computing
• Software engineering
• Software
• Greek letters
• Denotational semantics
• Logic in computer science
• Lua
• Normal distribution
• San
• String

Math´ematiques `a rebours et un Lemme de K¨onig Faible de Type Ramsey Stage de Master 2 - MPRI mars - aoˆ ut 2012 Ludovic Patey ∗

Source URL: ludovicpatey.com

• Mathematical logic
• Computability theory
• Mathematics
• Theoretical computer science
• Proof theory
• Logic in computer science
• Theory of computation
• Second-order arithmetic
• Combinatory logic
• Reverse mathematics
• Computable function

Under consideration for publication in Math. Struct. in Comp. Science Formalization of Real Analysis: A Survey of Proof Assistants and Libraries∗ SYLVIE BOLDO CATHERINE LELAY

Source URL: www.lri.fr

• Proof assistants
• Real numbers
• Automated theorem proving
• Elementary mathematics
• Type theory
• First-order logic
• Construction of the real numbers
• Constructivism
• Mathematical logic
• Isabelle
• Axiom
• Setoid

Reducing OWL Entailment to Description Logic Satisfiability? Ian Horrocks1 and Peter F. Patel-Schneider2 1 Department of Computer Science

Source URL: www.cs.man.ac.uk

Fluctuations, effective learnability and metastability in analysis Ulrich Kohlenbach, Pavol Safarik Department of Mathematics, Technische Universit¨ at Darmstadt, Schlossgartenstraße 7, 64289 Darmstadt, Germany

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Mathematical logic
• Mathematics
• Theoretical computer science
• Theory of computation
• Computable function
• Primitive recursive function
• operator
• Language identification in the limit
• Sequence
• Arithmetical hierarchy
• Cauchy sequence

THE COMPLEXITY OF SATISFACTION PROBLEMS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of

Source URL: ludovicpatey.com

• Automated theorem proving
• Logic programming
• Logic in computer science
• Boolean algebra
• Model theory
• Substitution
• Boolean satisfiability problem
• Interpretation
• Relationships among probability distributions
• Lifting theory

Certified Symbolic Management of Financial Multi-party Contracts ∗ Jost Berthold Patrick Bahr Department of Computer Science,

Source URL: hiperfit.dk

• Theoretical computer science
• Logic
• Mathematical logic
• Denotational semantics
• Logic in computer science
• Symbol
• Substitution

On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Proof theory
• Mathematical logic
• Predicate logic
• Logic in computer science
• Primitive recursive functional
• Reverse mathematics
• Primitive recursive function
• Primitive recursive arithmetic
• First-order logic
• Peano axioms
• Ordinal analysis